Paraconsistent Preferential Reasoning by Signed Quantified Boolean Formulae
نویسنده
چکیده
We introduce a uniform approach of representing a variety of paraconsistent non-monotonic formalisms by quantified Boolean formulae (QBFs) in the context of four-valued semantics. This framework provides a useful platform for capturing, in a simple and natural way, a wide range of methods for preferential reasoning. Off-the-shelf QBF solvers may therefore be incorporated for simulating the corresponding consequence relations.
منابع مشابه
Models and Sets Dynamics, Interaction and Nonmonotonicity Paraconsistent Reasoning via Quantified Boolean Formulas, I: Axiomatising Signed Systems
Signed systems were introduced as a general, syntaxindependent framework for paraconsistent reasoning, that is, nontrivialised reasoning from inconsistent information. In this paper, we show how the family of corresponding paraconsistent consequence relations can be axiomatised by means of quantified Boolean formulas. This approach has several benefits. First, it furnishes an axiomatic specific...
متن کاملParaconsistent Reasoning via Quantified Boolean Formulas, I: Axiomatising Signed Systems
Signed systems were introduced as a general, syntax-independent framework for paraconsistent reasoning, that is, non-trivialised reasoning from inconsistent information. In this paper, we show how the family of corresponding paraconsistent consequence relations can be axiomatised by means of quantified Boolean formulas. This approach has several benefits. First, it furnishes an axiomatic specif...
متن کاملRepresenting Paraconsistent Reasoning via Quantified Propositional Logic
Quantified propositional logic is an extension of classical propositional logic where quantifications over atomic formulas are permitted. As such, quantified propositional logic is a fragment of secondorder logic, and its sentences are usually referred to as quantified Boolean formulas (QBFs). The motivation to study quantified propositional logic for paraconsistent reasoning is based on two fu...
متن کاملParaconsistent Reasoning via Quantified Boolean Formulas, II: Circumscribing Inconsistent Theories
Through minimal-model semantics, three-valued logics provide an interesting formalism for capturing reasoning from inconsistent information. However, the resulting paraconsistent logics lack so far a uniform implementation platform. Here, we address this and specifically provide a translation of two such paraconsistent logics into the language of quantified Boolean formulas (QBFs). These formul...
متن کاملFormula-Preferential Systems for Paraconsistent Non-Monotonic Reasoning
We provide a general framework for constructing natural consequence relations for paraconsistent and plausible nonmonotonic reasoning. The framework is based on preferential systems whose preferences are based on the satisfaction of formulas in models. The framework encompasses different types of preferential systems that were developed from different motivations of paraconsistent reasoning and...
متن کامل